Robustness of Case-Initialized Genetic Algorithms
نویسندگان
چکیده
We investigate the robustness of Case Initialized Genetic AlgoRithm (CIGAR) systems with respect problem indexing. When confronted with a series of similar problems CIGAR stores potential solutions in a case-base or an associative memory and retrieves and uses these solutions to help improve a genetic algorithm’s performance over time. Defining similarity among the problems, or indexing, is key to performance improvement. We study four indexing schemes on a class of simple problems and provide empirical evidence of CIGAR’s robustness to imperfect indexing.
منابع مشابه
Category: Genetic Algorithms a Sequential Similarity Metric for Case Injected Genetic Algorithms Applied to Tsps
We present and use a sequence similarity metric to solve sets of similar problems with case injected genetic algorithms. Rather than starting anew on each problem, we periodically inject a genetic algorithm's population with appropriate intermediate solutions to similar, previously solved problems. Using simple syntactic similarity measures, our experimental results from optimizing a series of ...
متن کاملIntelligent scalable image watermarking robust against progressive DWT-based compression using genetic algorithms
Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper a novel, intelligent, scalable, robust wavelet-based watermarking approach is proposed. The proposed approach employs a genetic algorithm to find nearly optimal positions to insert watermark. The embedding positions coded as chr...
متن کاملDesign of Neural Networks for Time Series Prediction Using Case-Initialized Genetic Algorithms
One of the major objectives of time series analysis is the design of time series models, used to support the decision-making in several application domains. Among the existing time series models, we highlight the Artificial Neural Networks (ANNs), which offer greater computational power than the classical linear models. However, as a drawback, the performance of ANNs is more vulnerable to wrong...
متن کاملKinetic Mechanism Reduction Using Genetic Algorithms, Case Study on H2/O2 Reaction
For large and complex reacting systems, computational efficiency becomes a critical issue in process simulation, optimization and model-based control. Mechanism simplification is often a necessity to improve computational speed. We present a novel approach to simplification of reaction networks that formulates the model reduction problem as an optimization problem and solves it using geneti...
متن کاملTHE EFFECTS OF INITIAL SAMPLING AND PENALTY FUNCTIONS IN OPTIMAL DESIGN OF TRUSSES USING METAHEURISTIC ALGORITHMS
Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999